Lecture 18 - 19 : Communication complexity lower bounds
نویسنده
چکیده
In the previous lecture we discussed the fooling set method for proving lower bounds on deterministic communication complexity. In this lecture we’ll see two more ways we can prove these lower bounds: the Rectangle Size Method and the Rank Method. Both of these are stronger than the fooling set method. We’ll show Ω(n) lower bounds for the dot product function with both methods while the fooling set method can only give Ω(log(n)). However, the two new techniques aren’t necessarily comparable among themselves.
منابع مشابه
Matrix Rank in Communication Complexity
This lecture focuses on proving communication lower bounds using matrix rank. Similar to fooling sets and rectangle size bounds, the matrix rank technique also gives a lower bound on the number of monochromatic rectangles in any partition of X × Y but it does so in an algebraic way[1]. This makes algebraic tools available for proving communication lower bounds. We begin by solving the problem a...
متن کاملCS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 9 : Lower Bounds in Property Testing ∗
We first give a brief introduction to the field of property testing. Section 3 gives upper bounds for the canonical property of “monotonicity testing,” and Section 4 shows how to derive property testing lower bounds from communication complexity lower bounds. We won’t need to develop any new communication complexity; our existing toolbox (specifically, Disjointness) is already rich enough to de...
متن کاملCS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 8 : Lower Bounds in Property Testing ∗
We begin in this section with a brief introduction to the field of property testing. Section 2 explains the famous example of “linearity testing.” Section 3 gives upper bounds for the canonical problem of “monotonicity testing,” and Section 4 shows how to derive property testing lower bounds from communication complexity lower bounds. These lower bounds will follow from our existing communicati...
متن کامل5 . Applications to streaming
In this lecture, we will see applications of communication complexity to proving lower bounds for streaming algorithms. Towards the end of the lecture, we will introduce combinatorial auctions, and we will see applications of communication complexity to auctions in the next lecture. The references for this lecture include Lecture 7 of Troy Lee’s course on communication complexity [Lee10], Lectu...
متن کاملRazborov Disjointness Lower Bound , Forster ’ S Theorem
In this lecture, we show two results dealing with lower bounds in communication complexity. The first lower bound is an Ω(n) lower bound on the distributional complexity of Disjointness due to [3, 8]. Here we will present the simplified proof presented in [8]. In the second part, we will show how to obtain lower bounds on the unbounded error probabilistic communication complexity by Forster’s m...
متن کامل